Just-in-time scheduling in identical parallel machine sequence-dependent group scheduling problem

<p style='text-indent:20px;'>In this research, a parallel machine sequence-dependent group scheduling problem with the goal of minimizing total weighted earliness and tardiness is investigated. First, mathematical model developed for research which can be used solving small-sized instances. Since shown to NP-hard, focuses on proposing meta-heuristic algorithms finding near-optimal solutions. In regard, main contribution apply Biogeography-based Optimization (BBO) algorithm as novel Variable Neighborhood Search (VNS) best-known one. order evaluate solution methods, several computational experiments are conducted. The demonstrate efficiency proposed in terms speed quality. maximum gap BBO 1.04% VNS algorithm, it 1.35%.</p>